Study of Turbo Codes and Decoding in Binary Erasure Channel Based on Stopping Set Analysis

نویسنده

  • Jeong Woo Lee
چکیده

In this paper, we define a stopping set of turbo codes with the iterative decoding in the binary erasure channel. Based on the stopping set analysis, we study the block and bit erasure probabilities of turbo codes and the performance degradation of the iterative decoding against the maximum-likelihood decoding. The error floor performance of turbo codes with the iterative decoding is dominated by the small stopping sets. The performance degradation of the iterative decoding is negligible in the error floor region, so the error floor performance is asymptotically dominated by the low weight codewords. key words: turbo codes, iterative decoding, stopping set, block/bit erasure probability, error floor

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fountain Uncorrectable Sets and Finite-Length Analysis

Decoding performance of Fountain codes for the binary erasure channel (BEC) depends on two aspects. One is the essential code structure, on which stopping set analysis operates. The other is the effect from the channel characteristic, which is difficult to give a precise estimation. To tackle these problems, in this paper, we propose a solution to analyzing the performance of Fountain codes bas...

متن کامل

Impact of Stopping Set Properties on Iterative Decoding of FG-LDPC Codes on the Binary Symmetric Channel

Stopping set properties determine the iterative decoding performance of any linear block code on the Binary Erasure Channel (BEC). Furthermore, there is a common conception that they are crucial factors on other channels, like the Binary Symmetric Channel (BSC), as well. In order to investigate whether this is true indeed, we study stopping set properties and iterative decoding performance on t...

متن کامل

Scaling Law of Turbo Codes over the Binary Erasure Channel

Since turbo codes with iterative decoding were introduced [1], a huge amount of research activities have been conducted on the evaluation or prediction of the performance of turbo codes. The iterative turbo decoding algorithm can be analyzed by studying two open-loop constituent decoders separately [2]–[6]. Given the statistic of communication channel output, the behavior of each constituent de...

متن کامل

Adaptive Decoding Algorithms for Low-Density Parity-Check Codes over the Binary Erasure Channel

Two decoding procedures combined with a beliefpropagation (BP) decoding algorithm for low-density parity-check codes over the binary erasure channel are presented. These algorithms continue a decoding procedure after the BP decoding algorithm terminates. We derive a condition that our decoding algorithms can correct an erased bit which is uncorrectable by the BP decoding algorithm. We show by s...

متن کامل

Analyse asymptotique et conception robuste de codes Raptor pour le décodage conjoint

In this paper, we consider the joint decoding of Raptor codes on a binary input additive white Gaussian noise channel. Raptor codes are rateless fountain codes that have the attractive property of being universal on the binary erasure channel: they can approach arbitrarily close the capacity, independently of the channel parameter. It has been recently shown that Raptor codes are not universal ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEICE Transactions

دوره 89-B  شماره 

صفحات  -

تاریخ انتشار 2006